Abstract: The authors have modied the existing breadth first search (BFS) technique by incorporating a parallel processing feature to it. A multithreaded implementation of breadth-first search (BFS) of a graph using Open MP. the results of our research reveal that implementing BFS using multiprocessor runs much faster than the standard BFS.

Keywords: Breadth-First Search, Parallel Programming, optimal Network Traversal Open MP.